An improved reverse converter for the moduli set {2n-1, 2n, 2n+1, 2n+1-1}
نویسندگان
چکیده
منابع مشابه
An improved RNS reverse converter for the {22n+1-1, 2n, 2n-1} moduli set
In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {22n+1 − 1,2n,2n − 1}. First, we simplify the traditional Chinese Remainder Theorem in order to obtain a reverse converter that only requires arithmetic mod-(22n+1 − 1). Second, we further improve the resulting architecture to obtain a reverse converter that only uses Carry Save Adders and Carry Propaga...
متن کاملA reverse converter for the new 4-moduli set {2n + 3, 2n + 2, 2n + 1, 2n}
In this paper, we propose a new 4-moduli set {2n+ 3, 2n+ 2, 2n+ 1, 2n} that increases the dynamic range and the processing parallelism enabling efficient reverse conversion. First, we assume a general 4-moduli set {mi}i=1,4, m1 > m2 > m3 > m4, with the dynamic range M = ∏4 i=1 mi and introduce a modified Chinese Remainder Theorem (CRT) that requires mod-m4 instead of mod-M calculations. Subsequ...
متن کاملResidue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}
This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.
متن کاملA Reduced-Area Reverse Converter for the Moduli Set {2n, 2n-1, 22n-1-1}
Abstract The three-modulus residue number system (RNS) based on the moduli set {2, 2–1, 2–1} has been recently introduced. The modulo (2+1)-free feature of this set enables it to provide fast realization of modular addition and multiplication circuits of RNS arithmetic unit. But, the latest design of the RNS to binary (reverse) converter for the moduli set {2, 2–1, 2–1} relies on large hardware...
متن کاملA Parallel Implementation of the Reverse Converter for the Moduli Set {2n, 2n–1, 2n–1–1}
In this paper, a new reverse converter for the moduli set {2n, 2n–1, 2n–1–1} is presented. We improved a previously introduced conversion algorithm for deriving an efficient hardware design for reverse converter. Hardware architecture of the proposed converter is based on carry-save adders and regular binary adders, without the requirement for modular adders. The presented design is faster than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2008
ISSN: 1349-2543
DOI: 10.1587/elex.5.672